Deformations of the Braid Arrangement and Trees Dedicated to Ira Gessel for His Retirement
نویسنده
چکیده
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form xi − xj = s for some integer s. Classical examples include the braid, Catalan, Shi, semiorder and Linial arrangements, as well as graphical arrangements. We express the number of regions of any such arrangement as a signed count of decorated plane trees. The characteristic and coboundary polynomials of these arrangements also have simple expressions in terms of these trees. We then focus on certain “well-behaved” deformations of the braid arrangement that we call transitive. This includes the Catalan, Shi, semiorder and Linial arrangements, as well as many other arrangements appearing in the literature. For any transitive deformation of the braid arrangement we establish a simple bijection between regions of the arrangement and a set of plane trees defined by local conditions. This answers a question of Gessel.
منابع مشابه
Hyperplane arrangements, interval orders, and trees.
A hyperplane arrangement is a finite set of hyperplanes in a real affine space. An especially important arrangement is the braid arrangement, which is the set of all hyperplanes xi - xj = 1, 1 </= i < j </= n, in Rn. Some combinatorial properties of certain deformations of the braid arrangement are surveyed. In particular, there are unexpected connections with the theory of interval orders and ...
متن کاملCounting unlabeled k-trees
We count unlabeled k-trees by properly coloring them in k + 1 colors and then counting orbits of these colorings under the action of the symmetric group on the colors.
متن کاملBijections between truncated affine arrangements and valued graphs
We present some contructions on the set of nbcs (No Broken Circuit sets) of some deformations of the braid arrangement. This leads us to some new bijective proofs for Shi, Linial and similar hyperplane arrangements. Mathematics Subject Classifications (2000): Primary 05C22; Secondary 05C15.
متن کاملA Bijective Approach to the Permutational Power of a Priority Queue
A priority queue transforms an input permutation p1 of a totally ordered set of size n into an output permutation p2. Atkinson and Thiyagarajah showed that the number of such pairs (p1; p2) is (n+1)n 1, which is well known to be the number of labeled trees on n + 1 vertices. We give a new proof of this result by finding a bijection from such pairs of permutations to labeled trees.
متن کاملA Refinement of Cayley's Formula for Trees
which reduce to (n + 1) for a = b = c = 1. We refine Cayley’s formula by showing that Pn(a, b, c) counts rooted forests by the number of trees and the number of proper vertices, which are vertices that are less than all of their proper descendants. Moreover, other evaluations of Pn(a, b, c) have similar interpretations for other types of trees and forests: k-ary trees, forests of ordered trees,...
متن کامل